Human limb segmentation in depth maps based on spatio-temporal Graph-cuts optimization

نویسندگان

  • Antonio Hernández-Vela
  • Nadezhda Zlateva
  • Alexander Marinov
  • Miguel Reyes
  • Petia Radeva
  • Dimo Dimov
  • Sergio Escalera
چکیده

We present a framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs. First, from a set of random depth features, Random Forest is used to infer a set of label probabilities for each data sample. This vector of probabilities is used as unary term in α − β swap Graph-cuts algorithm. Moreover, depth values of spatio-temporal neighboring data points are used as boundary potentials. Results on a new multi-label human depth data set show high performance in terms of segmentation overlapping of the novel methodology compared to classical approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Video Segmentation Using Iterated Graph Cuts Based on Spatio-temporal Volumes

We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio-temporal volumes with different bandwidths from the input video. We compute the prior probability obtained by the likelihood from a color histogram and a distance transform using the segmentation results from graph cuts in the...

متن کامل

Enforcing Monotonous Shape Growth or Shrinkage in Video Segmentation

One of the great challenges in computer vision is automatic segmentation of objects in videos. This task becomes more difficult when image sequences are subject to low signal-to-noise ratio or low contrast between intensities of neighboring structures. Such challenging data are acquired routinely, for example, in medical imaging or satellite remote sensing. While individual frames can be analyz...

متن کامل

Patch-Based Label Fusion with Spatio-Temporal Graph Cuts for Cardiac MR Images

A patch-based method is proposed for cardiac MR image sequence segmentation, combined with the graph cuts algorithm to guarantee spatio-temporal smoothness of the segmentation. It was tested on the challenge training set with 83 subjects and achieved an average Dice metric of 0.792 for the myocardium.

متن کامل

Spatio-Temporal Segmentation with Depth-Inferred Videos of Static Scenes

Extracting spatio-temporally consistent segments from a video sequence is a challenging problem due to the complexity of color, motion and occlusions. Most existing spatio-temporal segmentation approaches rely on pairwise motion estimation, which have inherent difficulties in handling large displacement with significant occlusions. This paper presents a novel spatio-temporal segmentation method...

متن کامل

Fast 4D segmentation of large datasets using graph cuts

In this paper, we propose to use 4D graph cuts for the segmentation of large spatio-temporal (4D) datasets. Indeed, as 4D datasets grow in popularity in many clinical areas, so will the demand for efficient general segmentation algorithms. The graph cuts method has become a leading method for complex 2D and 3D image segmentation in many applications. Despite a few attempts in 4D, the use of gra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JAISE

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2012